A Problem of Diophantus and Pell Numbers

نویسنده

  • Andrej Dujella
چکیده

The Greek mathematician Diophantus of Alexandria noted that the set { 1 16 , 33 16 , 17 4 , 105 16 } has the following property: the product of its any two distinct elements increased by 1 is a square of a rational number (see [3]). Fermat first found a set of four positive integers with the above property, and it was {1, 3, 8, 120}. In 1969, Davenport and Baker [2] showed that if positive integers 1, 3, 8 and d have this property then d must be 120. Let n be an integer. A set of positive integers {a1, a2, . . . , am} is said to have the property of Diophantus of order n, symbolically D(n), if aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. The sets with the property D(l2) were particularly discussed in [4]. It was proved that for any integer l and any set {a, b} with the property D(l2), where ab is not a perfect square, there exist an infinite number of sets of the form {a, b, c, d} with the property D(l2). This result is the generalization of well known result for l = 1 (see [8]). The proof of this result is based on the construction of the double sequences yn,m and zn,m which are defined in [4] by second order recurrences in each indices. Solving these recurrences we obtain

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the sum of Pell and Jacobsthal numbers by matrix method

In this paper‎, ‎we define two $n$-square upper Hessenberg matrices one of which corresponds to the adjacency matrix of a directed pseudo graph‎. ‎We investigate relations between permanents and determinants of these upper Hessenberg matrices‎, ‎and sum formulas of the well-known Pell and Jacobsthal sequences‎. ‎Finally‎, ‎we present two Maple 13 procedures in order to calculate permanents of t...

متن کامل

Generalized Fibonacci Numbers and the Problem of Diophantus

Let n be an integer. A set of positive integers {al9 -..,am} is said to have the property of Diophantus of order n, symbolically D(n) if, for all i,j-\...ym, i^j, the following holds: apj +n = b?, where btj is an integer. The set {a1,...,am} is called aDiophantine m-tuple. In this paper we construct several Diophantine quadruples whose elements are represented using generalized Fibonacci number...

متن کامل

Diophantus and the Arithmetica

“Knowing, my most esteemed friend Dionysius, that you are anxious to learn how to investigate problems in numbers, I have tried, beginning from the foundations on which the science is built up, to set forth to you the nature and power subsisting in numbers.” Thus Diophantus begins his great work Arithmetica (Heath, 129) and gives the world what would become its most ancient text on algebra. The...

متن کامل

Generalization of a problem of Diophantus

Greek mathematician Diophantus of Alexandria noted that the numbers 1 16 , 33 16 , 68 16 and 105 16 have the property that the product of any two of them when increased by 1 is a square of a rational number. Let n be an integer. We say the set of natural numbers {a1, a2, . . . , am} has the property of Diophantus of order n, in brief D(n), if for all i, j = 1, 2, . . . ,m, i 6= j, the following...

متن کامل

The sum and product of Fibonacci numbers and Lucas numbers, Pell numbers and Pell-Lucas numbers representation by matrix method

Denote by {Fn} and {Ln} the Fibonacci numbers and Lucas numbers, respectively. Let Fn = Fn × Ln and Ln = Fn + Ln. Denote by {Pn} and {Qn} the Pell numbers and Pell-Lucas numbers, respectively. Let Pn = Pn × Qn and Qn = Pn + Qn. In this paper, we give some determinants and permanent representations of Pn, Qn, Fn and Ln. Also, complex factorization formulas for those numbers are presented. Key–Wo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998